/*-
 * Copyright (c) 2006, 2007 FTS Team
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 4. Neither the name of the FTS Team nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *      HashTest.hpp
 *
 * $FTS$
 */
#include <FTS.hpp>
#include <Hash.hpp>
#include <HashFunctions.hpp>
#include <STLVector.hpp>

#include <stdio.h>
#include <sysexits.h>

using namespace FTSS;

using STLW::vector;

typedef Hash<TokenHash_t, vector<INT_32>, HashHasher, HashComparator> IndexerHash;
typedef Pair<TokenHash_t, vector<INT_32> > IndexerPair;

int main(void)
{
	IndexerHash    oIndexerHash(2);

	for (INT_32 iI = 0; iI < 11; iI++)
	{
		vector<INT_32> v; v.push_back(iI);
		oIndexerHash.insert(IndexerPair(TokenHash_t(iI), v));
	}
	vector<INT_32> v;

	oIndexerHash.insert(IndexerPair(TokenHash_t(0), v));
	oIndexerHash.insert(IndexerPair(TokenHash_t(16), v));

	IndexerHash oIndexerHash1(oIndexerHash);
	oIndexerHash1.insert(IndexerPair(TokenHash_t(16), v));

	INT_32 iCounter = 0;
	IndexerHash::iterator ithData = oIndexerHash.begin();
	while (ithData != oIndexerHash.end())
	{
		IndexerHash::iterator ithTMP = oIndexerHash.find(ithData -> first);
		if (ithTMP == oIndexerHash.end()) { fprintf(stderr, "ERROR: Cannot find key %u in hash!\n", INT_32(ithData -> first)); return EX_SOFTWARE; }
		++iCounter;
		++ithData;
	}

	fprintf(stderr, "size = %u, count = %d\n", INT_32(oIndexerHash.size()), iCounter);

	// make valgrind happy
	fclose(stdin);
	fclose(stdout);
	fclose(stderr);

return EX_OK;
}
// End.

